DCSL Research Overview

نویسنده

  • Saurabh Bagchi
چکیده

The Dependable Computing Systems Lab (DCSL) comprises students (graduate and undergraduate), post-doctoral researchers, and programming staff members within the School of Electrical and Computer Engineering, the Department of Computer Science, and two institute-wide centers – CERIAS (The Center for Education and Research in Information Assurance and Security) and NSF supported NEEScomm (Network for Earthquake Engineering Simulation).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance Compatible Set-Labeling Index of Graphs

Distance compatible set-labeling of a graph G is an injective setassignment f : V (G) → 2X , X a nonempty ground set, such that the corresponding induced function f⊕ : V (G)×V (G) → 2X −{∅}, defined by f⊕(u, v) = f(u) ⊕ f(v) satisfies | f⊕(u, v) |= k (u,v) d(u, v) for all distinct u, v ∈ V (G), where d(u, v) is the distance between u and v, and k (u,v) is a constant, not necessarily an integer;...

متن کامل

Somasekhar and Roy : Differential Current Switch Logic 3 Done

| A new logic family, Diierential Current Switch Logic (DCSL) for implementing clocked CMOS circuits has been developed. DCSL is in principle a clocked diieren-tial cascode voltage switch logic circuit (DCVS). The circuit topology outlines a generic method for reducing internal node swings in clocked DCVS logic circuits. In comparison to other forms of clocked DCVS, DCSL achieves better perform...

متن کامل

Distance Compatible Set-Labeling of Graphs

k-distance compatible set-labeling of a graph G is an injective setassignment f : V (G) → 2X , X a nonempty ground set, such that the corresponding induced function f⊕ : V (G)×V (G) → 2X −{∅}, defined by f⊕(u, v) = f(u) ⊕ f(v) satisfies | f⊕(u, v) |= k(u,v)d(u, v) for all distinct u, v ∈ V (G), where d(u, v) is the distance between u and v and k(u,v) is a constant, not necessarily an integer; G...

متن کامل

A Characterization of k-Uniform DCSL Graphs

Let an injective function f : V (G) → 2X, where V (G) is the vertex set of a graph G and 2X is the power set of a nonempty set X, be given. Consider the induced function f ⊕ : V (G) × V (G) → {Φ} defined by f⊕ (u, v) = f(u) ⊕ f(v), where f(u) ⊕ f(v) denotes the symmetric difference of the two sets. The function f is called a k-uniform dcsl (and X a k-uniform dcsl-set) of the graph G, if there e...

متن کامل

Differential Current Switch Logic: A Low Power DCVS Logic Family - Solid-State Circuits, IEEE Journal of

AbstructDifferential current switch logic (DCSL), a new logic ihmily for implementing clocked CMOS circuits, has been developed. DCSL is in principle a clocked differential cascode voltage switch logic circuit (DCVS). The circuit topology outlines a generic method for reducing internal node swings in clocked DCVS logic circuits. In comparison to other forms of clocked DCVS, DCSL achieves better...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2012